Notes on the divisibility of GCD and LCM Matrices
نویسندگان
چکیده
Let S = {x1,x2, . . . ,xn} be a set of positive integers, and let f be an arithmetical function. The matrices (S) f = [ f (gcd(xi,xj))] and [S] f = [ f (lcm[xi,xj])] are referred to as the greatest common divisor (GCD) and the least common multiple (LCM) matrices on S with respect to f , respectively. In this paper, we assume that the elements of the matrices (S) f and [S] f are integers and study the divisibility of GCD and LCM matrices and their unitary analogues in the ringMn(Z) of the n×nmatrices over the integers.
منابع مشابه
Divisibilty Properties of Gcd Ve Lcm Matrices
Let a, b and n be positive integers and let S = {x1, x2, . . . , xn} be a set of distinct positive integers. The n × n matrix (Sf ) = (f ((xi, xj))), having f evaluated at the greatest common divisor (xi, xj) of xi and xj as its ij−entry, is called the GCD matrix associated with f on the set S. Similarly, the n × n matrix [Sf ] = (f ([xi, xj ])) is called the LCM matrix associated with f on S. ...
متن کاملAn analysis of GCD and LCM matrices via the LDL^T-factorization
Let S = {x1, x2, . . . , xn} be a set of distinct positive integers such that gcd(xi, xj) ∈ S for 1 ≤ i, j ≤ n. Such a set is called GCD-closed. In 1875/1876, H.J.S. Smith showed that, if the set S is “factor-closed”, then the determinant of the matrix eij = gcd(xi, xj) is det(E) = ∏n m=1 φ(xm), where φ denotes Euler’s Phi-function. Since the early 1990’s there has been a rebirth of interest in...
متن کاملEla an Analysis of Gcd and Lcm Matrices via the Ldl -factorization∗
Let S = {x1, x2, . . . , xn} be a set of distinct positive integers such that gcd(xi, xj) ∈ S for 1 ≤ i, j ≤ n. Such a set is called GCD-closed. In 1875/1876, H.J.S. Smith showed that, if the set S is “factor-closed”, then the determinant of the matrix eij = gcd(xi, xj) is det(E) = ∏n m=1 φ(xm), where φ denotes Euler’s Phi-function. Since the early 1990’s there has been a rebirth of interest in...
متن کاملStrong divisibility and lcm-sequences
Let R be an integral domain in which every two nonzero elements have a greatest common divisor. Let (an)n>1 be a sequence of nonzero elements in R. We prove that gcd(an, am) = agcd(n,m) for all n,m > 1 if and only if an = ∏
متن کاملNew results on nonsingular power LCM matrices
Let e and n be positive integers and S = {x1, . . . , xn} be a set of n distinct positive integers. The n × n matrix having eth power [xi, xj ] of the least common multiple of xi and xj as its (i, j)-entry is called the eth power least common multiple (LCM) matrix on S, denoted by ([S]). The set S is said to be gcd closed (respectively, lcm closed) if (xi, xj) ∈ S (respectively, [xi, xj ] ∈ S) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005